On Cross-Intersecting Families of Set Partitions

نویسندگان

  • Cheng Yeaw Ku
  • Kok Bin Wong
چکیده

Let B(n) denote the collection of all set partitions of [n]. Suppose A1,A2 ⊆ B(n) are cross-intersecting i.e. for all A1 ∈ A1 and A2 ∈ A2, we have A1 ∩A2 6= ∅. It is proved that for sufficiently large n,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

k-Efficient partitions of graphs

A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...

متن کامل

On cross-intersecting families

Frankl, P., On cross-intersecting families, Discrete Mathematics 108 (1992) 291-295. Let n 3 t z 1 be integers. Let 9, YI be families of subsets of the n-element set X. They are called cross t-intersecting if IF n GI 2 t holds for all F E 9 and G E 3. If 9 = CfI then 9 is called t-intersecting. Let m(n, t) denote the maximum possible cardinality of a r-intersecting family. Our main result says ...

متن کامل

Multiple cross-intersecting families of signed sets

A k-signed r-set on [n] = {1, ..., n} is an ordered pair (A, f), where A is an rsubset of [n] and f is a function from A to [k]. Families A1, ...,Ap are said to be cross-intersecting if any set in any family Ai intersects any set in any other family Aj . Hilton proved a sharp bound for the sum of sizes of cross-intersecting families of r-subsets of [n]. Our aim is to generalise Hilton's bound t...

متن کامل

Cross-Intersecting Families of Partial Permutations

For positive integers r and n with r ≤ n, let Pn,r be the family of all sets {(x1, y1), ..., (xr, yr)} such that x1, ..., xr are distinct elements of [n] := {1, ..., n} and y1, ..., yr are also distinct elements of [n]. Pn,n describes permutations of [n]. For r < n, Pn,r describes r-partial permutations of [n]. Families A1, ...,Ak of sets are said to be cross-intersecting if, for any distinct i...

متن کامل

THE EIGENVALUE METHOD FOR CROSS t-INTERSECTING FAMILIES

We show that the Erdős–Ko–Rado inequality for t-intersecting families of subsets can be easily extended to an inequality for cross t-intersecting families by using the eigenvalue method. The same applies to the case of t-intersecting families of subspaces. The eigenvalue method is one of the proof techniques to get Erdős–Ko–Rado type inequalities for t-intersecting families, for example, a proo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2012